/* A Bison parser, made by GNU Bison 3.8.2.  */

/* Bison implementation for Yacc-like parsers in C

   Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 Free Software Foundation,
   Inc.

   This program is free software: you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation, either version 3 of the License, or
   (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program.  If not, see <https://www.gnu.org/licenses/>.  */

/* As a special exception, you may create a larger work that contains
   part or all of the Bison parser skeleton and distribute that work
   under terms of your choice, so long as that work isn't itself a
   parser generator using the skeleton or a modified version thereof
   as a parser skeleton.  Alternatively, if you modify or redistribute
   the parser skeleton itself, you may (at your option) remove this
   special exception, which will cause the skeleton and the resulting
   Bison output files to be licensed under the GNU General Public
   License without this special exception.

   This special exception was added by the Free Software Foundation in
   version 2.2 of Bison.  */

/* C LALR(1) parser skeleton written by Richard Stallman, by
   simplifying the original so-called "semantic" parser.  */

/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
   especially those whose name start with YY_ or yy_.  They are
   private implementation details that can be changed or removed.  */

/* All symbols defined below should begin with yy or YY, to avoid
   infringing on user name space.  This should be done even for local
   variables, as they might otherwise be expanded by user macros.
   There are some unavoidable exceptions within include files to
   define necessary library symbols; they are noted "INFRINGES ON
   USER NAME SPACE" below.  */

/* Identify Bison output, and Bison version.  */
#define YYBISON 30802

/* Bison version string.  */
#define YYBISON_VERSION "3.8.2"

/* Skeleton name.  */
#define YYSKELETON_NAME "yacc.c"

/* Pure parsers.  */
#define YYPURE 0

/* Push parsers.  */
#define YYPUSH 0

/* Pull parsers.  */
#define YYPULL 1




/* First part of user prologue.  */
#line 2 "myfile.y"

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>

#ifdef _WIN32
#define strdup _strdup
#endif

// DAG节点结构
struct DAGNode {
    char op[10];
    char arg1[20];
    char arg2[20];
    char result[20];
    int visited;
    int id;
    struct DAGNode* left;   // 添加左子节点
    struct DAGNode* right;  // 添加右子节点
};

// 四元式结构
struct Quadruple {
    char op[10];
    char arg1[20];
    char arg2[20];
    char result[20];
};

// Loop结构
struct Loop {
    int header;         // 循环头
    int end;           // 循环尾
    int *body;         // 循环体中的四元式索引
    int body_size;     // 循环体大小
    char *init_var;    // 循环初始化变量
    char *counter;     // 循环计数器
    int step;          // 步长
    int limit;         // 循环限制值
    int parent;        // 父循环索引
    bool is_nested;    // 是否是嵌套循环
    int init_quad;     // 初始化四元式的位置
    int update_quad;   // 更新四元式的位置
    struct Quadruple* invariant_code; // 循环不变代码
    int invariant_count;              // 不变代码数量
};

void yyerror(const char *s);
int yylex(void);

/* 符号表结构 */
struct symbol {
    char *name;
    int type;    // 0: int, 1: float
    double value;
};

#define NSYMS 100     /* 符号表大小 */
struct symbol symtab[NSYMS];
int sym_count = 0;    /* 符号表中的符号数量 */

/* 四元式序列 */
struct Quadruple quadruples[100];
int quad_count = 0;

/* 存储优化后的四元式 */
struct Quadruple optimized_quads[100];
int optimized_quad_count = 0;

/* 基本块标记数组 */
char is_leader[100] = {0};

/* 全局变量 */
int temp_var_count = 0;  // 用于生成临时变量名

/* 函数声明 */
void print_quadruple(struct Quadruple q);
char* new_temp(void);
void generate_quad(char *op, char *arg1, char *arg2, char *result);
void print_quads(void);
struct DAGNode* find_dag_node(struct DAGNode *dag, int dag_size, char *op, char *arg1, char *arg2);
void build_dag(int start, int end, struct DAGNode *dag, int *dag_size);
void optimize_dag(struct DAGNode *dag, int dag_size);
void print_optimized_quads(void);
void find_loops(struct Loop* loops, int* num_loops);
void loop_invariant_code_motion(struct Loop* loop);
void strength_reduction(struct Loop* loop);
void induction_variable_elimination(struct Loop* loop);
void insert_quadruple(int position, const char* op, const char* arg1, const char* arg2, const char* result);

/* 生成标签 */
char* new_label() {
    static int label_count = 0;
    char* label = (char*)malloc(20);
    sprintf(label, "L%d", label_count++);
    return label;
}

/* 查找符号 */
struct symbol* lookup(char* name) {
    for(int i = 0; i < sym_count; i++) {
        if(strcmp(symtab[i].name, name) == 0) {
            return &symtab[i];
        }
    }
    return NULL;
}

/* 添加符号 */
void add_symbol(char* name, int type) {
    if(sym_count < NSYMS) {
        symtab[sym_count].name = strdup(name);
        symtab[sym_count].type = type;
        symtab[sym_count].value = 0;
        sym_count++;
    }
}

/* 函数实现 */
void print_quadruple(struct Quadruple q) {
    printf("%s, %s, %s, %s\n", q.op, q.arg1, q.arg2, q.result);
}

/* 生成临时变量名 */
char* new_temp() {
    static int temp_count = 0;
    char* temp = (char*)malloc(20);
    sprintf(temp, "t%d", temp_count++);
    return temp;
}

/* 添加四元式 */
void generate_quad(char *op, char *arg1, char *arg2, char *result) {
    strcpy(quadruples[quad_count].op, op);
    strcpy(quadruples[quad_count].arg1, arg1);
    strcpy(quadruples[quad_count].arg2, arg2);
    strcpy(quadruples[quad_count].result, result);
    quad_count++;
}

/* 输出所有四元式 */
void print_quads() {
    for (int i = 0; i < quad_count; i++) {
        print_quadruple(quadruples[i]);
    }
}

/* 构建基本块的DAG */
void build_dag(int start, int end, struct DAGNode *dag, int *dag_size) {
    *dag_size = 0;
    for (int i = start; i <= end && i < quad_count; i++) {
        if (strcmp(quadruples[i].op, "+") == 0 || strcmp(quadruples[i].op, "-") == 0 ||
            strcmp(quadruples[i].op, "*") == 0 || strcmp(quadruples[i].op, "/") == 0) {
            struct DAGNode *existing_node = find_dag_node(dag, *dag_size, quadruples[i].op, quadruples[i].arg1, quadruples[i].arg2);
            if (existing_node != NULL) {
                strcpy(existing_node->result, quadruples[i].result);
                continue;
            }
            strcpy(dag[*dag_size].op, quadruples[i].op);
            strcpy(dag[*dag_size].arg1, quadruples[i].arg1);
            strcpy(dag[*dag_size].arg2, quadruples[i].arg2);
            strcpy(dag[*dag_size].result, quadruples[i].result);
            dag[*dag_size].visited = 0;
            dag[*dag_size].id = *dag_size;
            (*dag_size)++;
        } else if (strcmp(quadruples[i].op, "=") == 0) {
            for (int j = 0; j < *dag_size; j++) {
                if (strcmp(dag[j].result, quadruples[i].arg1) == 0) {
                    strcpy(dag[j].result, quadruples[i].result);
                    break;
                }
            }
        }
    }
}

/* 查找DAG中已存在的节点 */
struct DAGNode* find_dag_node(struct DAGNode *dag, int dag_size, char *op, char *arg1, char *arg2) {
    for (int i = 0; i < dag_size; i++) {
        if (strcmp(dag[i].op, op) == 0 && strcmp(dag[i].arg1, arg1) == 0 && strcmp(dag[i].arg2, arg2) == 0) {
            return &dag[i];
        }
    }
    return NULL;
}

/* 改进的DAG优化函数 */
void optimize_dag(struct DAGNode *dag, int dag_size) {
    printf("\nDAG Optimization Results:\n");
    
    // 创建一个数组标记哪些四元式被优化了
    bool optimized[100] = {false};
    optimized_quad_count = 0;
    
    // 首先添加优化后的四元式
    for (int i = 0; i < dag_size; i++) {
        if (strlen(dag[i].op) > 0) {
            strcpy(optimized_quads[optimized_quad_count].op, dag[i].op);
            strcpy(optimized_quads[optimized_quad_count].arg1, dag[i].arg1);
            strcpy(optimized_quads[optimized_quad_count].arg2, dag[i].arg2);
            strcpy(optimized_quads[optimized_quad_count].result, dag[i].result);
            optimized_quad_count++;
            
            // 标记被优化的四元式
            for (int j = 0; j < quad_count; j++) {
                if (strcmp(quadruples[j].result, dag[i].result) == 0) {
                    optimized[j] = true;
                }
            }
        }
    }
    
    // 添加未被优化的四元式
    for (int i = 0; i < quad_count; i++) {
        if (!optimized[i]) {
            optimized_quads[optimized_quad_count++] = quadruples[i];
        }
    }
    
    printf("Complete optimized quadruples (including unoptimized parts):\n");
    for (int i = 0; i < optimized_quad_count; i++) {
        printf("L%d: ", i);
        print_quadruple(optimized_quads[i]);
    }
}

/* 打印优化后的四元式 */
void print_optimized_quads() {
    for (int i = 0; i < optimized_quad_count; i++) {
        printf("    ");
        print_quadruple(optimized_quads[i]);
    }
}

/* 添加辅助函数 */
bool is_constant(const char* str) {
    return str[0] >= '0' && str[0] <= '9';
}

bool is_temp_var(const char* str) {
    return str[0] == 't';
}

char* get_real_var(const char* temp_var, int current_pos) {
    for (int i = current_pos - 1; i >= 0; i--) {
        if (strcmp(quadruples[i].result, temp_var) == 0) {
            return quadruples[i].arg1;
        }
    }
    return NULL;
}

/* 改进的循环识别函数 */
void find_loops(struct Loop* loops, int* num_loops) {
    *num_loops = 0;
    
    for (int i = 0; i < quad_count; i++) {
        // 识别循环条件语句
        if (strcmp(quadruples[i].op, "<") == 0 || 
            strcmp(quadruples[i].op, ">") == 0 ||
            strcmp(quadruples[i].op, "<=") == 0 ||
            strcmp(quadruples[i].op, ">=") == 0) {
            
            // 向后查找goto指令
            for (int j = i + 1; j < quad_count; j++) {
                if (strcmp(quadruples[j].op, "goto") == 0) {
                    // 初始化循环结构
                    loops[*num_loops].header = i;
                    loops[*num_loops].end = j;
                    loops[*num_loops].body = (int*)malloc(sizeof(int) * (j - i + 1));
                    loops[*num_loops].body_size = 0;
                    loops[*num_loops].parent = -1;
                    loops[*num_loops].is_nested = false;
                    loops[*num_loops].invariant_code = (struct Quadruple*)malloc(sizeof(struct Quadruple) * 100);
                    loops[*num_loops].invariant_count = 0;
                    
                    // 识别循环变量
                    loops[*num_loops].counter = strdup(quadruples[i].arg1);
                    
                    // 查找循环变量初始化
                    for (int k = 0; k < i; k++) {
                        if (strcmp(quadruples[k].op, "=") == 0 && 
                            strcmp(quadruples[k].result, loops[*num_loops].counter) == 0) {
                            loops[*num_loops].init_var = strdup(quadruples[k].arg1);
                            loops[*num_loops].init_quad = k;
                            break;
                        }
                    }
                    
                    // 识别循环限制值
                    if (is_constant(quadruples[i].arg2)) {
                        loops[*num_loops].limit = atoi(quadruples[i].arg2);
                    }
                    
                    // 识别步长和更新位置
                    for (int k = i + 1; k < j; k++) {
                        if ((strcmp(quadruples[k].op, "+") == 0 || 
                             strcmp(quadruples[k].op, "-") == 0) &&
                            strcmp(quadruples[k].result, loops[*num_loops].counter) == 0) {
                            loops[*num_loops].step = atoi(quadruples[k].arg2);
                            loops[*num_loops].update_quad = k;
                            break;
                        }
                    }
                    
                    // 收集循环体
                    for (int k = i + 1; k < j; k++) {
                        loops[*num_loops].body[loops[*num_loops].body_size++] = k;
                    }
                    
                    printf("\nFound Loop %d:\n", *num_loops);
                    printf("  Header: L%d\n", loops[*num_loops].header);
                    printf("  Counter: %s\n", loops[*num_loops].counter);
                    printf("  Init: %s (at L%d)\n", loops[*num_loops].init_var, loops[*num_loops].init_quad);
                    printf("  Step: %d (at L%d)\n", loops[*num_loops].step, loops[*num_loops].update_quad);
                    printf("  Body size: %d\n", loops[*num_loops].body_size);
                    
                    (*num_loops)++;
                    break;
                }
            }
        }
    }
    
    // 识别嵌套关系
    for (int i = 0; i < *num_loops; i++) {
        for (int j = 0; j < *num_loops; j++) {
            if (i != j && 
                loops[j].header > loops[i].header && 
                loops[j].end < loops[i].end) {
                loops[j].parent = i;
                loops[j].is_nested = true;
                printf("Loop %d is nested inside Loop %d\n", j, i);
            }
        }
    }
}

/* 改进的循环不变代码外提 */
void loop_invariant_code_motion(struct Loop* loop) {
    printf("\nLoop Invariant Code Motion Analysis:\n");
    
    // 显示原始循环代码
    printf("Original loop code:\n");
    for (int i = 0; i < loop->body_size; i++) {
        int idx = loop->body[i];
        printf("L%d: ", idx);
        print_quadruple(quadruples[idx]);
    }
    
    // 识别循环不变代码
    for (int i = 0; i < loop->body_size; i++) {
        int idx = loop->body[i];
        struct Quadruple* quad = &quadruples[idx];
        
        bool is_invariant = true;
        
        // 检查操作数是否在循环中被修改
        if (strcmp(quad->op, "+") == 0 || strcmp(quad->op, "*") == 0 ||
            strcmp(quad->op, "-") == 0 || strcmp(quad->op, "/") == 0) {
            
            for (int j = 0; j < loop->body_size; j++) {
                int check_idx = loop->body[j];
                if (strcmp(quadruples[check_idx].result, quad->arg1) == 0 ||
                    strcmp(quadruples[check_idx].result, quad->arg2) == 0) {
                    is_invariant = false;
                    break;
                }
            }
            
            if (is_invariant) {
                printf("Found invariant computation at L%d: ", idx);
                print_quadruple(*quad);
                
                // 保存不变代码
                loop->invariant_code[loop->invariant_count++] = *quad;
                
                // 创建临时变量
                char* temp = new_temp();
                
                // 循环前插入不变计算
                insert_quadruple(loop->header, 
                               quad->op, 
                               quad->arg1, 
                               quad->arg2, 
                               temp);
                
                // 在循环中使用临时变量
                strcpy(quad->op, "=");
                strcpy(quad->arg1, temp);
                strcpy(quad->arg2, "");
            }
        }
    }
    
    printf("\nOptimized loop code:\n");
    for (int i = loop->header; i <= loop->end; i++) {
        printf("L%d: ", i);
        print_quadruple(quadruples[i]);
    }
}

/* 改进的强度削弱优化 */
void strength_reduction(struct Loop* loop) {
    printf("\nStrength Reduction Analysis:\n");
    
    // 显示原始代码
    printf("Original code:\n");
    for (int i = 0; i < loop->body_size; i++) {
        int idx = loop->body[i];
        printf("L%d: ", idx);
        print_quadruple(quadruples[idx]);
    }
    
    // 遍历循环体中的每条指令
    for (int i = 0; i < loop->body_size; i++) {
        int idx = loop->body[i];
        struct Quadruple* quad = &quadruples[idx];
        
        // 乘法优化为移位
        if (strcmp(quad->op, "*") == 0 && is_constant(quad->arg2)) {
            int value = atoi(quad->arg2);
            if ((value & (value - 1)) == 0) {  // 是2的幂
                int shift = 0;
                while (value > 1) {
                    shift++;
                    value >>= 1;
                }
                
                printf("Converting multiplication at L%d to shift: ", idx);
                print_quadruple(*quad);
                
                char shift_str[20];
                sprintf(shift_str, "%d", shift);
                strcpy(quad->op, "<<");
                strcpy(quad->arg2, shift_str);
            }
        }
        // 除法优化为移位
        else if (strcmp(quad->op, "/") == 0 && is_constant(quad->arg2)) {
            int value = atoi(quad->arg2);
            if ((value & (value - 1)) == 0) {  // 是2的幂
                int shift = 0;
                while (value > 1) {
                    shift++;
                    value >>= 1;
                }
                
                printf("Converting division at L%d to shift: ", idx);
                print_quadruple(*quad);
                
                char shift_str[20];
                sprintf(shift_str, "%d", shift);
                strcpy(quad->op, ">>");
                strcpy(quad->arg2, shift_str);
            }
        }
    }
    
    printf("\nOptimized code:\n");
    for (int i = loop->header; i <= loop->end; i++) {
        printf("L%d: ", i);
        print_quadruple(quadruples[i]);
    }
}

/* 改进的归纳变量优化 */
void induction_variable_elimination(struct Loop* loop) {
    printf("\nInduction Variable Analysis:\n");
    
    // 识别基本归纳变量
    char* basic_induction_vars[100];
    int basic_count = 0;
    
    for (int i = 0; i < loop->body_size; i++) {
        int idx = loop->body[i];
        if (strcmp(quadruples[idx].op, "+") == 0 && 
            strcmp(quadruples[idx].result, quadruples[idx].arg1) == 0) {
            basic_induction_vars[basic_count++] = strdup(quadruples[idx].result);
            printf("Found basic induction variable: %s\n", quadruples[idx].result);
        }
    }
    
    // 识别并优化派生归纳变量
    for (int i = 0; i < loop->body_size; i++) {
        int idx = loop->body[i];
        for (int j = 0; j < basic_count; j++) {
            if (strcmp(quadruples[idx].arg1, basic_induction_vars[j]) == 0 ||
                strcmp(quadruples[idx].arg2, basic_induction_vars[j]) == 0) {
                printf("Found derived induction variable at L%d: ", idx);
                print_quadruple(quadruples[idx]);
                
                // 这里可以添加派生归纳变量的优化逻辑
            }
        }
    }
}

/* 插入四元式 */
void insert_quadruple(int position, const char* op, const char* arg1, const char* arg2, const char* result) {
    // 将position之后的四元式向后移动一位
    for (int i = quad_count; i > position; i--) {
        quadruples[i] = quadruples[i-1];
    }
    
    // 在position处插入新的四元式
    strcpy(quadruples[position].op, op);
    strcpy(quadruples[position].arg1, arg1);
    strcpy(quadruples[position].arg2, arg2);
    strcpy(quadruples[position].result, result);
    
    quad_count++;
}

/* 改进的循环优化处理函数 */
void process_loop_optimizations(struct Loop* loops, int num_loops) {
    if (num_loops > 0) {
        // 创建一个临时数组存储完整的优化后四元式
        struct Quadruple final_quads[100];
        int final_count = 0;
        
        // 复制DAG优化后的四元式到临时数组
        for (int i = 0; i < optimized_quad_count; i++) {
            final_quads[final_count++] = optimized_quads[i];
        }
        
        // 对每个循环进行优化
        for (int i = 0; i < num_loops; i++) {
            printf("\nOptimizing Loop %d:\n", i + 1);
            
            // 显示原始循环代码
            printf("Original loop code:\n");
            for (int j = loops[i].header; j <= loops[i].end; j++) {
                printf("L%d: ", j);
                print_quadruple(final_quads[j]);
            }
            
            // 应用循环优化
            loop_invariant_code_motion(&loops[i]);
            strength_reduction(&loops[i]);
            induction_variable_elimination(&loops[i]);
            
            // 更新最终的四元式序列
            for (int j = loops[i].header; j <= loops[i].end; j++) {
                final_quads[j] = quadruples[j];
            }
        }
        
        // 显示最终完整的优化结果
        printf("\nFinal Complete Optimized Code:\n");
        for (int i = 0; i < final_count; i++) {
            printf("L%d: ", i);
            print_quadruple(final_quads[i]);
        }
    } else {
        printf("No loops found in the code.\n");
    }
}


#line 633 "myfile.tab.c"

# ifndef YY_CAST
#  ifdef __cplusplus
#   define YY_CAST(Type, Val) static_cast<Type> (Val)
#   define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
#  else
#   define YY_CAST(Type, Val) ((Type) (Val))
#   define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
#  endif
# endif
# ifndef YY_NULLPTR
#  if defined __cplusplus
#   if 201103L <= __cplusplus
#    define YY_NULLPTR nullptr
#   else
#    define YY_NULLPTR 0
#   endif
#  else
#   define YY_NULLPTR ((void*)0)
#  endif
# endif

#include "myfile.tab.h"
/* Symbol kind.  */
enum yysymbol_kind_t
{
  YYSYMBOL_YYEMPTY = -2,
  YYSYMBOL_YYEOF = 0,                      /* "end of file"  */
  YYSYMBOL_YYerror = 1,                    /* error  */
  YYSYMBOL_YYUNDEF = 2,                    /* "invalid token"  */
  YYSYMBOL_EOL = 3,                        /* EOL  */
  YYSYMBOL_UMINUS = 4,                     /* UMINUS  */
  YYSYMBOL_VOID = 5,                       /* VOID  */
  YYSYMBOL_MAIN = 6,                       /* MAIN  */
  YYSYMBOL_FOR = 7,                        /* FOR  */
  YYSYMBOL_NUMBER = 8,                     /* NUMBER  */
  YYSYMBOL_IDENTIFIER = 9,                 /* IDENTIFIER  */
  YYSYMBOL_ASSIGN = 10,                    /* ASSIGN  */
  YYSYMBOL_INT = 11,                       /* INT  */
  YYSYMBOL_FLOAT = 12,                     /* FLOAT  */
  YYSYMBOL_IF = 13,                        /* IF  */
  YYSYMBOL_ELSE = 14,                      /* ELSE  */
  YYSYMBOL_WHILE = 15,                     /* WHILE  */
  YYSYMBOL_SEMICOLON = 16,                 /* SEMICOLON  */
  YYSYMBOL_LPAREN = 17,                    /* LPAREN  */
  YYSYMBOL_RPAREN = 18,                    /* RPAREN  */
  YYSYMBOL_LBRACE = 19,                    /* LBRACE  */
  YYSYMBOL_RBRACE = 20,                    /* RBRACE  */
  YYSYMBOL_COMMA = 21,                     /* COMMA  */
  YYSYMBOL_GT = 22,                        /* GT  */
  YYSYMBOL_LT = 23,                        /* LT  */
  YYSYMBOL_EQ = 24,                        /* EQ  */
  YYSYMBOL_NE = 25,                        /* NE  */
  YYSYMBOL_GE = 26,                        /* GE  */
  YYSYMBOL_LE = 27,                        /* LE  */
  YYSYMBOL_28_ = 28,                       /* '+'  */
  YYSYMBOL_29_ = 29,                       /* '-'  */
  YYSYMBOL_30_ = 30,                       /* '*'  */
  YYSYMBOL_31_ = 31,                       /* '/'  */
  YYSYMBOL_YYACCEPT = 32,                  /* $accept  */
  YYSYMBOL_program = 33,                   /* program  */
  YYSYMBOL_function = 34,                  /* function  */
  YYSYMBOL_block = 35,                     /* block  */
  YYSYMBOL_statement_list = 36,            /* statement_list  */
  YYSYMBOL_statement = 37,                 /* statement  */
  YYSYMBOL_declaration = 38,               /* declaration  */
  YYSYMBOL_id_list = 39,                   /* id_list  */
  YYSYMBOL_assignment = 40,                /* assignment  */
  YYSYMBOL_for_init = 41,                  /* for_init  */
  YYSYMBOL_for_update = 42,                /* for_update  */
  YYSYMBOL_if_statement = 43,              /* if_statement  */
  YYSYMBOL_while_statement = 44,           /* while_statement  */
  YYSYMBOL_for_statement = 45,             /* for_statement  */
  YYSYMBOL_condition = 46,                 /* condition  */
  YYSYMBOL_expr = 47,                      /* expr  */
  YYSYMBOL_term = 48,                      /* term  */
  YYSYMBOL_factor = 49                     /* factor  */
};
typedef enum yysymbol_kind_t yysymbol_kind_t;




#ifdef short
# undef short
#endif

/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
   <limits.h> and (if available) <stdint.h> are included
   so that the code can choose integer types of a good width.  */

#ifndef __PTRDIFF_MAX__
# include <limits.h> /* INFRINGES ON USER NAME SPACE */
# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
#  include <stdint.h> /* INFRINGES ON USER NAME SPACE */
#  define YY_STDINT_H
# endif
#endif

/* Narrow types that promote to a signed type and that can represent a
   signed or unsigned integer of at least N bits.  In tables they can
   save space and decrease cache pressure.  Promoting to a signed type
   helps avoid bugs in integer arithmetic.  */

#ifdef __INT_LEAST8_MAX__
typedef __INT_LEAST8_TYPE__ yytype_int8;
#elif defined YY_STDINT_H
typedef int_least8_t yytype_int8;
#else
typedef signed char yytype_int8;
#endif

#ifdef __INT_LEAST16_MAX__
typedef __INT_LEAST16_TYPE__ yytype_int16;
#elif defined YY_STDINT_H
typedef int_least16_t yytype_int16;
#else
typedef short yytype_int16;
#endif

/* Work around bug in HP-UX 11.23, which defines these macros
   incorrectly for preprocessor constants.  This workaround can likely
   be removed in 2023, as HPE has promised support for HP-UX 11.23
   (aka HP-UX 11i v2) only through the end of 2022; see Table 2 of
   <https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>.  */
#ifdef __hpux
# undef UINT_LEAST8_MAX
# undef UINT_LEAST16_MAX
# define UINT_LEAST8_MAX 255
# define UINT_LEAST16_MAX 65535
#endif

#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
typedef __UINT_LEAST8_TYPE__ yytype_uint8;
#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
       && UINT_LEAST8_MAX <= INT_MAX)
typedef uint_least8_t yytype_uint8;
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
typedef unsigned char yytype_uint8;
#else
typedef short yytype_uint8;
#endif

#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
typedef __UINT_LEAST16_TYPE__ yytype_uint16;
#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
       && UINT_LEAST16_MAX <= INT_MAX)
typedef uint_least16_t yytype_uint16;
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
typedef unsigned short yytype_uint16;
#else
typedef int yytype_uint16;
#endif

#ifndef YYPTRDIFF_T
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
#  define YYPTRDIFF_T __PTRDIFF_TYPE__
#  define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
# elif defined PTRDIFF_MAX
#  ifndef ptrdiff_t
#   include <stddef.h> /* INFRINGES ON USER NAME SPACE */
#  endif
#  define YYPTRDIFF_T ptrdiff_t
#  define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
# else
#  define YYPTRDIFF_T long
#  define YYPTRDIFF_MAXIMUM LONG_MAX
# endif
#endif

#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
#  define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
#  define YYSIZE_T size_t
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
#  define YYSIZE_T size_t
# else
#  define YYSIZE_T unsigned
# endif
#endif

#define YYSIZE_MAXIMUM                                  \
  YY_CAST (YYPTRDIFF_T,                                 \
           (YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1)  \
            ? YYPTRDIFF_MAXIMUM                         \
            : YY_CAST (YYSIZE_T, -1)))

#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))


/* Stored state numbers (used for stacks). */
typedef yytype_int8 yy_state_t;

/* State numbers in computations.  */
typedef int yy_state_fast_t;

#ifndef YY_
# if defined YYENABLE_NLS && YYENABLE_NLS
#  if ENABLE_NLS
#   include <libintl.h> /* INFRINGES ON USER NAME SPACE */
#   define YY_(Msgid) dgettext ("bison-runtime", Msgid)
#  endif
# endif
# ifndef YY_
#  define YY_(Msgid) Msgid
# endif
#endif


#ifndef YY_ATTRIBUTE_PURE
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
#  define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
# else
#  define YY_ATTRIBUTE_PURE
# endif
#endif

#ifndef YY_ATTRIBUTE_UNUSED
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
#  define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
# else
#  define YY_ATTRIBUTE_UNUSED
# endif
#endif

/* Suppress unused-variable warnings by "using" E.  */
#if ! defined lint || defined __GNUC__
# define YY_USE(E) ((void) (E))
#else
# define YY_USE(E) /* empty */
#endif

/* Suppress an incorrect diagnostic about yylval being uninitialized.  */
#if defined __GNUC__ && ! defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__
# if __GNUC__ * 100 + __GNUC_MINOR__ < 407
#  define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN                           \
    _Pragma ("GCC diagnostic push")                                     \
    _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")
# else
#  define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN                           \
    _Pragma ("GCC diagnostic push")                                     \
    _Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")              \
    _Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# endif
# define YY_IGNORE_MAYBE_UNINITIALIZED_END      \
    _Pragma ("GCC diagnostic pop")
#else
# define YY_INITIAL_VALUE(Value) Value
#endif
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
#endif
#ifndef YY_INITIAL_VALUE
# define YY_INITIAL_VALUE(Value) /* Nothing. */
#endif

#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
# define YY_IGNORE_USELESS_CAST_BEGIN                          \
    _Pragma ("GCC diagnostic push")                            \
    _Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
# define YY_IGNORE_USELESS_CAST_END            \
    _Pragma ("GCC diagnostic pop")
#endif
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_END
#endif


#define YY_ASSERT(E) ((void) (0 && (E)))

#if !defined yyoverflow

/* The parser invokes alloca or malloc; define the necessary symbols.  */

# ifdef YYSTACK_USE_ALLOCA
#  if YYSTACK_USE_ALLOCA
#   ifdef __GNUC__
#    define YYSTACK_ALLOC __builtin_alloca
#   elif defined __BUILTIN_VA_ARG_INCR
#    include <alloca.h> /* INFRINGES ON USER NAME SPACE */
#   elif defined _AIX
#    define YYSTACK_ALLOC __alloca
#   elif defined _MSC_VER
#    include <malloc.h> /* INFRINGES ON USER NAME SPACE */
#    define alloca _alloca
#   else
#    define YYSTACK_ALLOC alloca
#    if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
#     include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
      /* Use EXIT_SUCCESS as a witness for stdlib.h.  */
#     ifndef EXIT_SUCCESS
#      define EXIT_SUCCESS 0
#     endif
#    endif
#   endif
#  endif
# endif

# ifdef YYSTACK_ALLOC
   /* Pacify GCC's 'empty if-body' warning.  */
#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
#  ifndef YYSTACK_ALLOC_MAXIMUM
    /* The OS might guarantee only one guard page at the bottom of the stack,
       and a page size can be as small as 4096 bytes.  So we cannot safely
       invoke alloca (N) if N exceeds 4096.  Use a slightly smaller number
       to allow for a few compiler-allocated temporary stack slots.  */
#   define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
#  endif
# else
#  define YYSTACK_ALLOC YYMALLOC
#  define YYSTACK_FREE YYFREE
#  ifndef YYSTACK_ALLOC_MAXIMUM
#   define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
#  endif
#  if (defined __cplusplus && ! defined EXIT_SUCCESS \
       && ! ((defined YYMALLOC || defined malloc) \
             && (defined YYFREE || defined free)))
#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
#   ifndef EXIT_SUCCESS
#    define EXIT_SUCCESS 0
#   endif
#  endif
#  ifndef YYMALLOC
#   define YYMALLOC malloc
#   if ! defined malloc && ! defined EXIT_SUCCESS
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
#   endif
#  endif
#  ifndef YYFREE
#   define YYFREE free
#   if ! defined free && ! defined EXIT_SUCCESS
void free (void *); /* INFRINGES ON USER NAME SPACE */
#   endif
#  endif
# endif
#endif /* !defined yyoverflow */

#if (! defined yyoverflow \
     && (! defined __cplusplus \
         || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))

/* A type that is properly aligned for any stack member.  */
union yyalloc
{
  yy_state_t yyss_alloc;
  YYSTYPE yyvs_alloc;
};

/* The size of the maximum gap between one aligned stack and the next.  */
# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)

/* The size of an array large to enough to hold all stacks, each with
   N elements.  */
# define YYSTACK_BYTES(N) \
     ((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \
      + YYSTACK_GAP_MAXIMUM)

# define YYCOPY_NEEDED 1

/* Relocate STACK from its old location to the new one.  The
   local variables YYSIZE and YYSTACKSIZE give the old and new number of
   elements in the stack, and YYPTR gives the new location of the
   stack.  Advance YYPTR to a properly aligned location for the next
   stack.  */
# define YYSTACK_RELOCATE(Stack_alloc, Stack)                           \
    do                                                                  \
      {                                                                 \
        YYPTRDIFF_T yynewbytes;                                         \
        YYCOPY (&yyptr->Stack_alloc, Stack, yysize);                    \
        Stack = &yyptr->Stack_alloc;                                    \
        yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
        yyptr += yynewbytes / YYSIZEOF (*yyptr);                        \
      }                                                                 \
    while (0)

#endif

#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
/* Copy COUNT objects from SRC to DST.  The source and destination do
   not overlap.  */
# ifndef YYCOPY
#  if defined __GNUC__ && 1 < __GNUC__
#   define YYCOPY(Dst, Src, Count) \
      __builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
#  else
#   define YYCOPY(Dst, Src, Count)              \
      do                                        \
        {                                       \
          YYPTRDIFF_T yyi;                      \
          for (yyi = 0; yyi < (Count); yyi++)   \
            (Dst)[yyi] = (Src)[yyi];            \
        }                                       \
      while (0)
#  endif
# endif
#endif /* !YYCOPY_NEEDED */

/* YYFINAL -- State number of the termination state.  */
#define YYFINAL  5
/* YYLAST -- Last index in YYTABLE.  */
#define YYLAST   96

/* YYNTOKENS -- Number of terminals.  */
#define YYNTOKENS  32
/* YYNNTS -- Number of nonterminals.  */
#define YYNNTS  18
/* YYNRULES -- Number of rules.  */
#define YYNRULES  42
/* YYNSTATES -- Number of states.  */
#define YYNSTATES  91

/* YYMAXUTOK -- Last valid token kind.  */
#define YYMAXUTOK   282


/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
   as returned by yylex, with out-of-bounds checking.  */
#define YYTRANSLATE(YYX)                                \
  (0 <= (YYX) && (YYX) <= YYMAXUTOK                     \
   ? YY_CAST (yysymbol_kind_t, yytranslate[YYX])        \
   : YYSYMBOL_YYUNDEF)

/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
   as returned by yylex.  */
static const yytype_int8 yytranslate[] =
{
       0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,    30,    28,     2,    29,     2,    31,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
       2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
       5,     6,     7,     8,     9,    10,    11,    12,    13,    14,
      15,    16,    17,    18,    19,    20,    21,    22,    23,    24,
      25,    26,    27
};

#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined.  */
static const yytype_int16 yyrline[] =
{
       0,   603,   603,   613,   619,   622,   628,   631,   634,   640,
     641,   642,   643,   644,   645,   646,   650,   654,   659,   667,
     694,   695,   699,   710,   724,   741,   745,   755,   765,   784,
     791,   798,   805,   815,   816,   821,   829,   830,   835,   843,
     850,   862,   863
};
#endif

/** Accessing symbol of state STATE.  */
#define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])

#if YYDEBUG || 0
/* The user-facing name of the symbol whose (internal) number is
   YYSYMBOL.  No bounds checking.  */
static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;

/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
   First, the terminals, then, starting at YYNTOKENS, nonterminals.  */
static const char *const yytname[] =
{
  "\"end of file\"", "error", "\"invalid token\"", "EOL", "UMINUS",
  "VOID", "MAIN", "FOR", "NUMBER", "IDENTIFIER", "ASSIGN", "INT", "FLOAT",
  "IF", "ELSE", "WHILE", "SEMICOLON", "LPAREN", "RPAREN", "LBRACE",
  "RBRACE", "COMMA", "GT", "LT", "EQ", "NE", "GE", "LE", "'+'", "'-'",
  "'*'", "'/'", "$accept", "program", "function", "block",
  "statement_list", "statement", "declaration", "id_list", "assignment",
  "for_init", "for_update", "if_statement", "while_statement",
  "for_statement", "condition", "expr", "term", "factor", YY_NULLPTR
};

static const char *
yysymbol_name (yysymbol_kind_t yysymbol)
{
  return yytname[yysymbol];
}
#endif

#define YYPACT_NINF (-26)

#define yypact_value_is_default(Yyn) \
  ((Yyn) == YYPACT_NINF)

#define YYTABLE_NINF (-1)

#define yytable_value_is_error(Yyn) \
  0

/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
   STATE-NUM.  */
static const yytype_int8 yypact[] =
{
       5,     6,    17,   -26,     4,   -26,    14,    21,    11,   -26,
     -26,    27,    38,    41,    37,    42,   -26,   -26,    36,   -26,
      45,    47,   -26,   -26,   -26,    -2,    -6,   -26,    46,    -6,
      -6,   -26,   -26,    53,   -26,   -26,   -26,   -26,    57,   -26,
     -26,    -6,    -6,     0,    50,   -26,    70,    68,    49,    69,
     -26,    -6,    24,   -26,    -6,    -6,    -6,    -6,   -26,    55,
      -6,    -6,    -6,    -6,    55,    72,   -26,    50,    50,   -26,
     -26,    75,     0,     0,     0,     0,   -26,    81,    55,    82,
      73,   -26,    -4,    55,    54,     0,   -26,    85,    86,   -26,
     -26
};

/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
   Performed when YYTABLE does not specify something else to do.  Zero
   means the default is an error.  */
static const yytype_int8 yydefact[] =
{
       0,     0,     0,     2,     0,     1,     0,     0,     0,     3,
      15,     0,     0,     0,     0,     0,     5,    14,     0,     6,
       0,     0,    11,    12,    13,     0,     0,    17,    16,     0,
       0,     4,     7,     0,     9,    10,    21,    20,     0,    39,
      40,     0,     0,    19,    33,    36,     0,     0,     0,     0,
       8,     0,     0,    42,     0,     0,     0,     0,    18,     0,
       0,     0,     0,     0,     0,     0,    41,    34,    35,    37,
      38,    25,    29,    30,    31,    32,    27,     0,     0,     0,
       0,    26,     0,     0,    40,    22,    28,     0,     0,    23,
      24
};

/* YYPGOTO[NTERM-NUM].  */
static const yytype_int8 yypgoto[] =
{
     -26,   -26,   -26,    88,   -26,   -18,    71,   -26,   -10,   -26,
     -26,   -26,   -26,   -26,   -24,   -25,    30,   -23
};

/* YYDEFGOTO[NTERM-NUM].  */
static const yytype_int8 yydefgoto[] =
{
       0,     2,     3,    17,    18,    19,    20,    28,    21,    38,
      80,    22,    23,    24,    47,    48,    44,    45
};

/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM.  If
   positive, shift that token.  If negative, reduce the rule whose
   number is the opposite.  If YYTABLE_NINF, syntax error.  */
static const yytype_int8 yytable[] =
{
      32,    43,    39,    40,    39,    84,    49,    12,    33,    13,
       1,    41,     4,    41,    10,    37,    52,     5,    11,    53,
      12,     6,    13,    42,    14,    42,    15,    65,    54,    55,
       8,    16,     7,    69,    70,    72,    73,    74,    75,    10,
       8,    71,    66,    11,    25,    12,    76,    13,    26,    14,
      27,    15,    54,    55,    29,     8,    31,    85,    10,    30,
      81,    34,    11,    35,    12,    86,    13,    46,    14,    50,
      15,    60,    61,    51,     8,    62,    63,    54,    55,    58,
      56,    57,    87,    88,    67,    68,    59,    64,    77,    78,
      79,    83,    82,    89,    90,     9,    36
};

static const yytype_int8 yycheck[] =
{
      18,    26,     8,     9,     8,     9,    30,     9,    18,    11,
       5,    17,     6,    17,     3,    25,    41,     0,     7,    42,
       9,    17,    11,    29,    13,    29,    15,    51,    28,    29,
      19,    20,    18,    56,    57,    60,    61,    62,    63,     3,
      19,    59,    18,     7,    17,     9,    64,    11,    10,    13,
       9,    15,    28,    29,    17,    19,    20,    82,     3,    17,
      78,    16,     7,    16,     9,    83,    11,    21,    13,    16,
      15,    22,    23,    16,    19,    26,    27,    28,    29,     9,
      30,    31,    28,    29,    54,    55,    18,    18,    16,    14,
       9,    18,    10,     8,     8,     7,    25
};

/* YYSTOS[STATE-NUM] -- The symbol kind of the accessing symbol of
   state STATE-NUM.  */
static const yytype_int8 yystos[] =
{
       0,     5,    33,    34,     6,     0,    17,    18,    19,    35,
       3,     7,     9,    11,    13,    15,    20,    35,    36,    37,
      38,    40,    43,    44,    45,    17,    10,     9,    39,    17,
      17,    20,    37,    40,    16,    16,    38,    40,    41,     8,
       9,    17,    29,    47,    48,    49,    21,    46,    47,    46,
      16,    16,    47,    49,    28,    29,    30,    31,     9,    18,
      22,    23,    26,    27,    18,    46,    18,    48,    48,    49,
      49,    37,    47,    47,    47,    47,    37,    16,    14,     9,
      42,    37,    10,    18,     9,    47,    37,    28,    29,     8,
       8
};

/* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM.  */
static const yytype_int8 yyr1[] =
{
       0,    32,    33,    34,    35,    35,    36,    36,    36,    37,
      37,    37,    37,    37,    37,    37,    38,    39,    39,    40,
      41,    41,    42,    42,    42,    43,    43,    44,    45,    46,
      46,    46,    46,    47,    47,    47,    48,    48,    48,    49,
      49,    49,    49
};

/* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM.  */
static const yytype_int8 yyr2[] =
{
       0,     2,     1,     5,     3,     2,     1,     2,     3,     2,
       2,     1,     1,     1,     1,     1,     2,     1,     3,     3,
       1,     1,     3,     5,     5,     5,     7,     5,     9,     3,
       3,     3,     3,     1,     3,     3,     1,     3,     3,     1,
       1,     3,     2
};


enum { YYENOMEM = -2 };

#define yyerrok         (yyerrstatus = 0)
#define yyclearin       (yychar = YYEMPTY)

#define YYACCEPT        goto yyacceptlab
#define YYABORT         goto yyabortlab
#define YYERROR         goto yyerrorlab
#define YYNOMEM         goto yyexhaustedlab


#define YYRECOVERING()  (!!yyerrstatus)

#define YYBACKUP(Token, Value)                                    \
  do                                                              \
    if (yychar == YYEMPTY)                                        \
      {                                                           \
        yychar = (Token);                                         \
        yylval = (Value);                                         \
        YYPOPSTACK (yylen);                                       \
        yystate = *yyssp;                                         \
        goto yybackup;                                            \
      }                                                           \
    else                                                          \
      {                                                           \
        yyerror (YY_("syntax error: cannot back up")); \
        YYERROR;                                                  \
      }                                                           \
  while (0)

/* Backward compatibility with an undocumented macro.
   Use YYerror or YYUNDEF. */
#define YYERRCODE YYUNDEF


/* Enable debugging if requested.  */
#if YYDEBUG

# ifndef YYFPRINTF
#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
#  define YYFPRINTF fprintf
# endif

# define YYDPRINTF(Args)                        \
do {                                            \
  if (yydebug)                                  \
    YYFPRINTF Args;                             \
} while (0)




# define YY_SYMBOL_PRINT(Title, Kind, Value, Location)                    \
do {                                                                      \
  if (yydebug)                                                            \
    {                                                                     \
      YYFPRINTF (stderr, "%s ", Title);                                   \
      yy_symbol_print (stderr,                                            \
                  Kind, Value); \
      YYFPRINTF (stderr, "\n");                                           \
    }                                                                     \
} while (0)


/*-----------------------------------.
| Print this symbol's value on YYO.  |
`-----------------------------------*/

static void
yy_symbol_value_print (FILE *yyo,
                       yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
{
  FILE *yyoutput = yyo;
  YY_USE (yyoutput);
  if (!yyvaluep)
    return;
  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
  YY_USE (yykind);
  YY_IGNORE_MAYBE_UNINITIALIZED_END
}


/*---------------------------.
| Print this symbol on YYO.  |
`---------------------------*/

static void
yy_symbol_print (FILE *yyo,
                 yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
{
  YYFPRINTF (yyo, "%s %s (",
             yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));

  yy_symbol_value_print (yyo, yykind, yyvaluep);
  YYFPRINTF (yyo, ")");
}

/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included).                                                   |
`------------------------------------------------------------------*/

static void
yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop)
{
  YYFPRINTF (stderr, "Stack now");
  for (; yybottom <= yytop; yybottom++)
    {
      int yybot = *yybottom;
      YYFPRINTF (stderr, " %d", yybot);
    }
  YYFPRINTF (stderr, "\n");
}

# define YY_STACK_PRINT(Bottom, Top)                            \
do {                                                            \
  if (yydebug)                                                  \
    yy_stack_print ((Bottom), (Top));                           \
} while (0)


/*------------------------------------------------.
| Report that the YYRULE is going to be reduced.  |
`------------------------------------------------*/

static void
yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp,
                 int yyrule)
{
  int yylno = yyrline[yyrule];
  int yynrhs = yyr2[yyrule];
  int yyi;
  YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
             yyrule - 1, yylno);
  /* The symbols being reduced.  */
  for (yyi = 0; yyi < yynrhs; yyi++)
    {
      YYFPRINTF (stderr, "   $%d = ", yyi + 1);
      yy_symbol_print (stderr,
                       YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]),
                       &yyvsp[(yyi + 1) - (yynrhs)]);
      YYFPRINTF (stderr, "\n");
    }
}

# define YY_REDUCE_PRINT(Rule)          \
do {                                    \
  if (yydebug)                          \
    yy_reduce_print (yyssp, yyvsp, Rule); \
} while (0)

/* Nonzero means print parse trace.  It is left uninitialized so that
   multiple parsers can coexist.  */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args) ((void) 0)
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */


/* YYINITDEPTH -- initial size of the parser's stacks.  */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif

/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
   if the built-in stack extension method is used).

   Do not make this value too large; the results are undefined if
   YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
   evaluated with infinite-precision integer arithmetic.  */

#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif






/*-----------------------------------------------.
| Release the memory associated to this symbol.  |
`-----------------------------------------------*/

static void
yydestruct (const char *yymsg,
            yysymbol_kind_t yykind, YYSTYPE *yyvaluep)
{
  YY_USE (yyvaluep);
  if (!yymsg)
    yymsg = "Deleting";
  YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);

  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
  YY_USE (yykind);
  YY_IGNORE_MAYBE_UNINITIALIZED_END
}


/* Lookahead token kind.  */
int yychar;

/* The semantic value of the lookahead symbol.  */
YYSTYPE yylval;
/* Number of syntax errors so far.  */
int yynerrs;




/*----------.
| yyparse.  |
`----------*/

int
yyparse (void)
{
    yy_state_fast_t yystate = 0;
    /* Number of tokens to shift before error messages enabled.  */
    int yyerrstatus = 0;

    /* Refer to the stacks through separate pointers, to allow yyoverflow
       to reallocate them elsewhere.  */

    /* Their size.  */
    YYPTRDIFF_T yystacksize = YYINITDEPTH;

    /* The state stack: array, bottom, top.  */
    yy_state_t yyssa[YYINITDEPTH];
    yy_state_t *yyss = yyssa;
    yy_state_t *yyssp = yyss;

    /* The semantic value stack: array, bottom, top.  */
    YYSTYPE yyvsa[YYINITDEPTH];
    YYSTYPE *yyvs = yyvsa;
    YYSTYPE *yyvsp = yyvs;

  int yyn;
  /* The return value of yyparse.  */
  int yyresult;
  /* Lookahead symbol kind.  */
  yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;
  /* The variables used to return semantic value and location from the
     action routines.  */
  YYSTYPE yyval;



#define YYPOPSTACK(N)   (yyvsp -= (N), yyssp -= (N))

  /* The number of symbols on the RHS of the reduced rule.
     Keep to zero when no symbol should be popped.  */
  int yylen = 0;

  YYDPRINTF ((stderr, "Starting parse\n"));

  yychar = YYEMPTY; /* Cause a token to be read.  */

  goto yysetstate;


/*------------------------------------------------------------.
| yynewstate -- push a new state, which is found in yystate.  |
`------------------------------------------------------------*/
yynewstate:
  /* In all cases, when you get here, the value and location stacks
     have just been pushed.  So pushing a state here evens the stacks.  */
  yyssp++;


/*--------------------------------------------------------------------.
| yysetstate -- set current state (the top of the stack) to yystate.  |
`--------------------------------------------------------------------*/
yysetstate:
  YYDPRINTF ((stderr, "Entering state %d\n", yystate));
  YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
  YY_IGNORE_USELESS_CAST_BEGIN
  *yyssp = YY_CAST (yy_state_t, yystate);
  YY_IGNORE_USELESS_CAST_END
  YY_STACK_PRINT (yyss, yyssp);

  if (yyss + yystacksize - 1 <= yyssp)
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
    YYNOMEM;
#else
    {
      /* Get the current used size of the three stacks, in elements.  */
      YYPTRDIFF_T yysize = yyssp - yyss + 1;

# if defined yyoverflow
      {
        /* Give user a chance to reallocate the stack.  Use copies of
           these so that the &'s don't force the real ones into
           memory.  */
        yy_state_t *yyss1 = yyss;
        YYSTYPE *yyvs1 = yyvs;

        /* Each stack pointer address is followed by the size of the
           data in use in that stack, in bytes.  This used to be a
           conditional around just the two extra args, but that might
           be undefined if yyoverflow is a macro.  */
        yyoverflow (YY_("memory exhausted"),
                    &yyss1, yysize * YYSIZEOF (*yyssp),
                    &yyvs1, yysize * YYSIZEOF (*yyvsp),
                    &yystacksize);
        yyss = yyss1;
        yyvs = yyvs1;
      }
# else /* defined YYSTACK_RELOCATE */
      /* Extend the stack our own way.  */
      if (YYMAXDEPTH <= yystacksize)
        YYNOMEM;
      yystacksize *= 2;
      if (YYMAXDEPTH < yystacksize)
        yystacksize = YYMAXDEPTH;

      {
        yy_state_t *yyss1 = yyss;
        union yyalloc *yyptr =
          YY_CAST (union yyalloc *,
                   YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));
        if (! yyptr)
          YYNOMEM;
        YYSTACK_RELOCATE (yyss_alloc, yyss);
        YYSTACK_RELOCATE (yyvs_alloc, yyvs);
#  undef YYSTACK_RELOCATE
        if (yyss1 != yyssa)
          YYSTACK_FREE (yyss1);
      }
# endif

      yyssp = yyss + yysize - 1;
      yyvsp = yyvs + yysize - 1;

      YY_IGNORE_USELESS_CAST_BEGIN
      YYDPRINTF ((stderr, "Stack size increased to %ld\n",
                  YY_CAST (long, yystacksize)));
      YY_IGNORE_USELESS_CAST_END

      if (yyss + yystacksize - 1 <= yyssp)
        YYABORT;
    }
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */


  if (yystate == YYFINAL)
    YYACCEPT;

  goto yybackup;


/*-----------.
| yybackup.  |
`-----------*/
yybackup:
  /* Do appropriate processing given the current state.  Read a
     lookahead token if we need one and don't already have one.  */

  /* First try to decide what to do without reference to lookahead token.  */
  yyn = yypact[yystate];
  if (yypact_value_is_default (yyn))
    goto yydefault;

  /* Not known => get a lookahead token if don't already have one.  */

  /* YYCHAR is either empty, or end-of-input, or a valid lookahead.  */
  if (yychar == YYEMPTY)
    {
      YYDPRINTF ((stderr, "Reading a token\n"));
      yychar = yylex ();
    }

  if (yychar <= YYEOF)
    {
      yychar = YYEOF;
      yytoken = YYSYMBOL_YYEOF;
      YYDPRINTF ((stderr, "Now at end of input.\n"));
    }
  else if (yychar == YYerror)
    {
      /* The scanner already issued an error message, process directly
         to error recovery.  But do not keep the error token as
         lookahead, it is too special and may lead us to an endless
         loop in error recovery. */
      yychar = YYUNDEF;
      yytoken = YYSYMBOL_YYerror;
      goto yyerrlab1;
    }
  else
    {
      yytoken = YYTRANSLATE (yychar);
      YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
    }

  /* If the proper action on seeing token YYTOKEN is to reduce or to
     detect an error, take that action.  */
  yyn += yytoken;
  if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
    goto yydefault;
  yyn = yytable[yyn];
  if (yyn <= 0)
    {
      if (yytable_value_is_error (yyn))
        goto yyerrlab;
      yyn = -yyn;
      goto yyreduce;
    }

  /* Count tokens shifted since error; after three, turn off error
     status.  */
  if (yyerrstatus)
    yyerrstatus--;

  /* Shift the lookahead token.  */
  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
  yystate = yyn;
  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
  *++yyvsp = yylval;
  YY_IGNORE_MAYBE_UNINITIALIZED_END

  /* Discard the shifted token.  */
  yychar = YYEMPTY;
  goto yynewstate;


/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state.  |
`-----------------------------------------------------------*/
yydefault:
  yyn = yydefact[yystate];
  if (yyn == 0)
    goto yyerrlab;
  goto yyreduce;


/*-----------------------------.
| yyreduce -- do a reduction.  |
`-----------------------------*/
yyreduce:
  /* yyn is the number of a rule to reduce with.  */
  yylen = yyr2[yyn];

  /* If YYLEN is nonzero, implement the default value of the action:
     '$$ = $1'.

     Otherwise, the following line sets YYVAL to garbage.
     This behavior is undocumented and Bison
     users should not rely upon it.  Assigning to YYVAL
     unconditionally makes the parser a bit smaller, and it avoids a
     GCC warning that YYVAL may be used uninitialized.  */
  yyval = yyvsp[1-yylen];


  YY_REDUCE_PRINT (yyn);
  switch (yyn)
    {
  case 2: /* program: function  */
#line 603 "myfile.y"
                { 
        printf("\n=== Starting Program Analysis ===\n");
        printf("Program parsed successfully\n"); 
        printf("Semantic analysis completed\n");
        printf("Quadruples generated:\n");
        print_quads();
    }
#line 1729 "myfile.tab.c"
    break;

  case 3: /* function: VOID MAIN LPAREN RPAREN block  */
#line 613 "myfile.y"
                                  {
        printf("Function 'main' parsed successfully\n");
    }
#line 1737 "myfile.tab.c"
    break;

  case 4: /* block: LBRACE statement_list RBRACE  */
#line 619 "myfile.y"
                                 {
        printf("Block parsed with statements\n");
    }
#line 1745 "myfile.tab.c"
    break;

  case 5: /* block: LBRACE RBRACE  */
#line 622 "myfile.y"
                    {
        printf("Empty block parsed\n");
    }
#line 1753 "myfile.tab.c"
    break;

  case 6: /* statement_list: statement  */
#line 628 "myfile.y"
              {
        printf("Single statement parsed\n");
    }
#line 1761 "myfile.tab.c"
    break;

  case 7: /* statement_list: statement_list statement  */
#line 631 "myfile.y"
                               {
        printf("Multiple statements parsed\n");
    }
#line 1769 "myfile.tab.c"
    break;

  case 8: /* statement_list: statement_list assignment SEMICOLON  */
#line 634 "myfile.y"
                                          {
        printf("Additional assignment statement parsed\n");
    }
#line 1777 "myfile.tab.c"
    break;

  case 16: /* declaration: INT id_list  */
#line 650 "myfile.y"
                   { (yyval.str) = (yyvsp[0].str); }
#line 1783 "myfile.tab.c"
    break;

  case 17: /* id_list: IDENTIFIER  */
#line 654 "myfile.y"
               {
        printf("Declaration: int %s\n", (yyvsp[0].str));
        add_symbol((yyvsp[0].str), 0);
        (yyval.str) = (yyvsp[0].str);
    }
#line 1793 "myfile.tab.c"
    break;

  case 18: /* id_list: id_list COMMA IDENTIFIER  */
#line 659 "myfile.y"
                               {
        printf("Multiple declaration: int %s\n", (yyvsp[0].str));
        add_symbol((yyvsp[0].str), 0);
        (yyval.str) = (yyvsp[0].str);
    }
#line 1803 "myfile.tab.c"
    break;

  case 19: /* assignment: IDENTIFIER ASSIGN expr  */
#line 667 "myfile.y"
                              { 
        printf("Assignment to %s\n", (yyvsp[-2].str));
        struct symbol* sym = lookup((yyvsp[-2].str));
        if(sym != NULL) {
            generate_quad("=", (yyvsp[0].temp), "", (yyvsp[-2].str));
            (yyval.temp) = (yyvsp[-2].str);
        } else {
            yyerror("Undefined variable");
            (yyval.temp) = "";
        }
    }
#line 1819 "myfile.tab.c"
    break;

  case 22: /* for_update: IDENTIFIER ASSIGN expr  */
#line 699 "myfile.y"
                              { 
        printf("Semantic analysis: updating variable %s\n", (yyvsp[-2].str));
        struct symbol* sym = lookup((yyvsp[-2].str));
        if(sym != NULL) {
            generate_quad("=", (yyvsp[0].temp), "", (yyvsp[-2].str));
            (yyval.temp) = (yyvsp[-2].str);
        } else {
            yyerror("Undefined variable");
            (yyval.temp) = "";
        }
    }
#line 1835 "myfile.tab.c"
    break;

  case 23: /* for_update: IDENTIFIER ASSIGN IDENTIFIER '+' NUMBER  */
#line 710 "myfile.y"
                                              {
        struct symbol* sym = lookup((yyvsp[-4].str));
        if(sym != NULL) {
            char* temp = new_temp();
            char num_str[20];
            sprintf(num_str, "%g", (yyvsp[0].num));
            generate_quad("+", (yyvsp[-2].str), num_str, temp);
            generate_quad("=", temp, "", (yyvsp[-4].str));
            (yyval.temp) = (yyvsp[-4].str);
        } else {
            yyerror("Undefined variable");
            (yyval.temp) = "";
        }
    }
#line 1854 "myfile.tab.c"
    break;

  case 24: /* for_update: IDENTIFIER ASSIGN IDENTIFIER '-' NUMBER  */
#line 724 "myfile.y"
                                              {
        struct symbol* sym = lookup((yyvsp[-4].str));
        if(sym != NULL) {
            char* temp = new_temp();
            char num_str[20];
            sprintf(num_str, "%g", (yyvsp[0].num));
            generate_quad("-", (yyvsp[-2].str), num_str, temp);
            generate_quad("=", temp, "", (yyvsp[-4].str));
            (yyval.temp) = (yyvsp[-4].str);
        } else {
            yyerror("Undefined variable");
            (yyval.temp) = "";
        }
    }
#line 1873 "myfile.tab.c"
    break;

  case 25: /* if_statement: IF LPAREN condition RPAREN statement  */
#line 741 "myfile.y"
                                         {
        generate_quad("label", "", "", (yyvsp[-2].labels).true_label);
        generate_quad("label", "", "", (yyvsp[-2].labels).false_label);
    }
#line 1882 "myfile.tab.c"
    break;

  case 26: /* if_statement: IF LPAREN condition RPAREN statement ELSE statement  */
#line 745 "myfile.y"
                                                          {
        char* end_label = new_label();
        generate_quad("label", "", "", (yyvsp[-4].labels).true_label);
        generate_quad("goto", "", "", end_label);
        generate_quad("label", "", "", (yyvsp[-4].labels).false_label);
        generate_quad("label", "", "", end_label);
    }
#line 1894 "myfile.tab.c"
    break;

  case 27: /* while_statement: WHILE LPAREN condition RPAREN statement  */
#line 755 "myfile.y"
                                            {
        char* start_label = new_label();
        generate_quad("label", "", "", start_label);
        generate_quad("label", "", "", (yyvsp[-2].labels).true_label);
        generate_quad("goto", "", "", start_label);
        generate_quad("label", "", "", (yyvsp[-2].labels).false_label);
    }
#line 1906 "myfile.tab.c"
    break;

  case 28: /* for_statement: FOR LPAREN for_init SEMICOLON condition SEMICOLON for_update RPAREN statement  */
#line 765 "myfile.y"
                                                                                  {
        printf("\n=== Processing FOR loop ===\n");
        char* start_label = new_label();
        char* update_label = new_label();
        char* end_label = new_label();
        printf("Generated labels: start=%s, update=%s, end=%s\n", 
               start_label, update_label, end_label);
        
        generate_quad("label", "", "", start_label);
        generate_quad("if", (yyvsp[-4].labels).true_label, "", "");
        generate_quad("if==0", "", "", end_label);
        generate_quad("label", "", "", update_label);
        generate_quad("goto", "", "", start_label);
        generate_quad("label", "", "", end_label);
        printf("FOR loop quadruples generated\n");
    }
#line 1927 "myfile.tab.c"
    break;

  case 29: /* condition: expr GT expr  */
#line 784 "myfile.y"
                     {
        printf("Condition: %s > %s\n", (yyvsp[-2].temp), (yyvsp[0].temp));
        (yyval.labels).true_label = new_label();
        (yyval.labels).false_label = new_label();
        generate_quad(">", (yyvsp[-2].temp), (yyvsp[0].temp), (yyval.labels).true_label);
        generate_quad("goto", "", "", (yyval.labels).false_label);
    }
#line 1939 "myfile.tab.c"
    break;

  case 30: /* condition: expr LT expr  */
#line 791 "myfile.y"
                     {
        printf("Condition: %s < %s\n", (yyvsp[-2].temp), (yyvsp[0].temp));
        (yyval.labels).true_label = new_label();
        (yyval.labels).false_label = new_label();
        generate_quad("<", (yyvsp[-2].temp), (yyvsp[0].temp), (yyval.labels).true_label);
        generate_quad("goto", "", "", (yyval.labels).false_label);
    }
#line 1951 "myfile.tab.c"
    break;

  case 31: /* condition: expr GE expr  */
#line 798 "myfile.y"
                     {
        printf("Condition: %s >= %s\n", (yyvsp[-2].temp), (yyvsp[0].temp));
        (yyval.labels).true_label = new_label();
        (yyval.labels).false_label = new_label();
        generate_quad(">=", (yyvsp[-2].temp), (yyvsp[0].temp), (yyval.labels).true_label);
        generate_quad("goto", "", "", (yyval.labels).false_label);
    }
#line 1963 "myfile.tab.c"
    break;

  case 32: /* condition: expr LE expr  */
#line 805 "myfile.y"
                     {
        printf("Condition: %s <= %s\n", (yyvsp[-2].temp), (yyvsp[0].temp));
        (yyval.labels).true_label = new_label();
        (yyval.labels).false_label = new_label();
        generate_quad("<=", (yyvsp[-2].temp), (yyvsp[0].temp), (yyval.labels).true_label);
        generate_quad("goto", "", "", (yyval.labels).false_label);
    }
#line 1975 "myfile.tab.c"
    break;

  case 33: /* expr: term  */
#line 815 "myfile.y"
                        { (yyval.temp) = (yyvsp[0].temp); }
#line 1981 "myfile.tab.c"
    break;

  case 34: /* expr: expr '+' term  */
#line 816 "myfile.y"
                        { 
        char* temp = new_temp();
        generate_quad("+", (yyvsp[-2].temp), (yyvsp[0].temp), temp);
        (yyval.temp) = temp;
    }
#line 1991 "myfile.tab.c"
    break;

  case 35: /* expr: expr '-' term  */
#line 821 "myfile.y"
                        { 
        char* temp = new_temp();
        generate_quad("-", (yyvsp[-2].temp), (yyvsp[0].temp), temp);
        (yyval.temp) = temp;
    }
#line 2001 "myfile.tab.c"
    break;

  case 36: /* term: factor  */
#line 829 "myfile.y"
                        { (yyval.temp) = (yyvsp[0].temp); }
#line 2007 "myfile.tab.c"
    break;

  case 37: /* term: term '*' factor  */
#line 830 "myfile.y"
                        { 
        char* temp = new_temp();
        generate_quad("*", (yyvsp[-2].temp), (yyvsp[0].temp), temp);
        (yyval.temp) = temp;
    }
#line 2017 "myfile.tab.c"
    break;

  case 38: /* term: term '/' factor  */
#line 835 "myfile.y"
                        { 
        char* temp = new_temp();
        generate_quad("/", (yyvsp[-2].temp), (yyvsp[0].temp), temp);
        (yyval.temp) = temp;
    }
#line 2027 "myfile.tab.c"
    break;

  case 39: /* factor: NUMBER  */
#line 843 "myfile.y"
                    { 
        char* temp = new_temp();
        char num_str[20];
        sprintf(num_str, "%g", (yyvsp[0].num));
        generate_quad("=", num_str, "", temp);
        (yyval.temp) = temp;
    }
#line 2039 "myfile.tab.c"
    break;

  case 40: /* factor: IDENTIFIER  */
#line 850 "myfile.y"
                    { 
        printf("Semantic analysis: reading variable %s\n", (yyvsp[0].str));
        struct symbol* sym = lookup((yyvsp[0].str));
        if(sym != NULL) {
            char* temp = new_temp();
            generate_quad("=", (yyvsp[0].str), "", temp);
            (yyval.temp) = temp;
        } else {
            yyerror("Undefined variable");
            (yyval.temp) = "";
        }
    }
#line 2056 "myfile.tab.c"
    break;

  case 41: /* factor: LPAREN expr RPAREN  */
#line 862 "myfile.y"
                            { (yyval.temp) = (yyvsp[-1].temp); }
#line 2062 "myfile.tab.c"
    break;

  case 42: /* factor: '-' factor  */
#line 863 "myfile.y"
                                { 
        char* temp = new_temp();
        generate_quad("-", "0", (yyvsp[0].temp), temp);
        (yyval.temp) = temp;
    }
#line 2072 "myfile.tab.c"
    break;


#line 2076 "myfile.tab.c"

      default: break;
    }
  /* User semantic actions sometimes alter yychar, and that requires
     that yytoken be updated with the new translation.  We take the
     approach of translating immediately before every use of yytoken.
     One alternative is translating here after every semantic action,
     but that translation would be missed if the semantic action invokes
     YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
     if it invokes YYBACKUP.  In the case of YYABORT or YYACCEPT, an
     incorrect destructor might then be invoked immediately.  In the
     case of YYERROR or YYBACKUP, subsequent parser actions might lead
     to an incorrect destructor call or verbose syntax error message
     before the lookahead is translated.  */
  YY_SYMBOL_PRINT ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);

  YYPOPSTACK (yylen);
  yylen = 0;

  *++yyvsp = yyval;

  /* Now 'shift' the result of the reduction.  Determine what state
     that goes to, based on the state we popped back to and the rule
     number reduced by.  */
  {
    const int yylhs = yyr1[yyn] - YYNTOKENS;
    const int yyi = yypgoto[yylhs] + *yyssp;
    yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
               ? yytable[yyi]
               : yydefgoto[yylhs]);
  }

  goto yynewstate;


/*--------------------------------------.
| yyerrlab -- here on detecting error.  |
`--------------------------------------*/
yyerrlab:
  /* Make sure we have latest lookahead translation.  See comments at
     user semantic actions for why this is necessary.  */
  yytoken = yychar == YYEMPTY ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar);
  /* If not already recovering from an error, report this error.  */
  if (!yyerrstatus)
    {
      ++yynerrs;
      yyerror (YY_("syntax error"));
    }

  if (yyerrstatus == 3)
    {
      /* If just tried and failed to reuse lookahead token after an
         error, discard it.  */

      if (yychar <= YYEOF)
        {
          /* Return failure if at end of input.  */
          if (yychar == YYEOF)
            YYABORT;
        }
      else
        {
          yydestruct ("Error: discarding",
                      yytoken, &yylval);
          yychar = YYEMPTY;
        }
    }

  /* Else will try to reuse lookahead token after shifting the error
     token.  */
  goto yyerrlab1;


/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR.  |
`---------------------------------------------------*/
yyerrorlab:
  /* Pacify compilers when the user code never invokes YYERROR and the
     label yyerrorlab therefore never appears in user code.  */
  if (0)
    YYERROR;
  ++yynerrs;

  /* Do not reclaim the symbols of the rule whose action triggered
     this YYERROR.  */
  YYPOPSTACK (yylen);
  yylen = 0;
  YY_STACK_PRINT (yyss, yyssp);
  yystate = *yyssp;
  goto yyerrlab1;


/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR.  |
`-------------------------------------------------------------*/
yyerrlab1:
  yyerrstatus = 3;      /* Each real token shifted decrements this.  */

  /* Pop stack until we find a state that shifts the error token.  */
  for (;;)
    {
      yyn = yypact[yystate];
      if (!yypact_value_is_default (yyn))
        {
          yyn += YYSYMBOL_YYerror;
          if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror)
            {
              yyn = yytable[yyn];
              if (0 < yyn)
                break;
            }
        }

      /* Pop the current state because it cannot handle the error token.  */
      if (yyssp == yyss)
        YYABORT;


      yydestruct ("Error: popping",
                  YY_ACCESSING_SYMBOL (yystate), yyvsp);
      YYPOPSTACK (1);
      yystate = *yyssp;
      YY_STACK_PRINT (yyss, yyssp);
    }

  YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
  *++yyvsp = yylval;
  YY_IGNORE_MAYBE_UNINITIALIZED_END


  /* Shift the error token.  */
  YY_SYMBOL_PRINT ("Shifting", YY_ACCESSING_SYMBOL (yyn), yyvsp, yylsp);

  yystate = yyn;
  goto yynewstate;


/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here.  |
`-------------------------------------*/
yyacceptlab:
  yyresult = 0;
  goto yyreturnlab;


/*-----------------------------------.
| yyabortlab -- YYABORT comes here.  |
`-----------------------------------*/
yyabortlab:
  yyresult = 1;
  goto yyreturnlab;


/*-----------------------------------------------------------.
| yyexhaustedlab -- YYNOMEM (memory exhaustion) comes here.  |
`-----------------------------------------------------------*/
yyexhaustedlab:
  yyerror (YY_("memory exhausted"));
  yyresult = 2;
  goto yyreturnlab;


/*----------------------------------------------------------.
| yyreturnlab -- parsing is finished, clean up and return.  |
`----------------------------------------------------------*/
yyreturnlab:
  if (yychar != YYEMPTY)
    {
      /* Make sure we have latest lookahead translation.  See comments at
         user semantic actions for why this is necessary.  */
      yytoken = YYTRANSLATE (yychar);
      yydestruct ("Cleanup: discarding lookahead",
                  yytoken, &yylval);
    }
  /* Do not reclaim the symbols of the rule whose action triggered
     this YYABORT or YYACCEPT.  */
  YYPOPSTACK (yylen);
  YY_STACK_PRINT (yyss, yyssp);
  while (yyssp != yyss)
    {
      yydestruct ("Cleanup: popping",
                  YY_ACCESSING_SYMBOL (+*yyssp), yyvsp);
      YYPOPSTACK (1);
    }
#ifndef yyoverflow
  if (yyss != yyssa)
    YYSTACK_FREE (yyss);
#endif

  return yyresult;
}

#line 870 "myfile.y"


/* 第四部分：C代码实现，包括 main 函数和 yyerror */
void yyerror(const char *s) {
    printf("\n=== Error Detected ===\n");
    fprintf(stderr, "Syntax Error: %s\n", s);
    if (strstr(s, "syntax error")) {
        printf("Current parsing state:\n");
        printf("Last successful token: %s\n", yylval.str ? yylval.str : "unknown");
        fprintf(stderr, "Possible causes:\n");
        fprintf(stderr, "1. Missing semicolon\n");
        fprintf(stderr, "2. Unmatched parentheses or braces\n");
        fprintf(stderr, "3. Invalid operator usage\n");
        fprintf(stderr, "4. Undefined variables\n");
        fprintf(stderr, "5. Multiple assignments not properly separated\n");
    }
}

int main(void) {
    printf("\n=== Starting Compiler ===\n");
    printf("Waiting for input...\n");
    
    // 语法分析
    if (yyparse() != 0) {
        printf("\n=== Parsing Failed ===\n");
        fprintf(stderr, "Syntax error detected in the input program!\n");
        return 1;
    }
    
    printf("\n=== Parsing Completed Successfully ===\n");
    printf("\n=== Original Quadruples ===\n");
    print_quads();
    
    // DAG优���
    printf("\n=== DAG Optimization ===\n");
    struct DAGNode dag[100];
    int dag_size = 0;
    build_dag(0, quad_count-1, dag, &dag_size);
    optimize_dag(dag, dag_size);
    
    // 循环优化
    printf("\n=== Loop Optimization ===\n");
    struct Loop loops[100];
    int num_loops = 0;
    find_loops(loops, &num_loops);
    process_loop_optimizations(loops, num_loops);
    
    return 0;
}
